Counting Ones Without Broadword Operations

Broadword Implementation of Rank/Select Queries

Research on succinct data structures (data structures occupying space close to the informationtheoretical lower bound, but achieving speed similar to their standard counterparts) has steadily increased in the last few years. However, many theoretical constructions providing asymptotically optimal bounds are unusable in practise because of the very large constants involved. The study of practica...

A Non-Oblivious Reduction of Counting Ones to Multiplication

An algorithm counting the number of ones in a binary word is presented running in time O(log log b) where b is the number of ones. The operations available include bit-wise logical operations and multiplication.

Broadword Implementation of Parenthesis Queries

We continue the line of research started in [Vig08] proposing broadword (a.k.a. SWAR—“SIMD Within A Register”) algorithms for finding matching closed parentheses and the k-th far closed parenthesis. Our algorithms work in time O(logw) on a word of w bits, and contain no branch and no test instruction. On 64-bit (and wider) architectures, these algorithms make it possible to avoid costly tabulat...

Specification Heterogeneity Independent Scheduling for Behavioural Synthesis

∗ Supported by Spanish Government Grant CICYT TIC-99 0474 Abstract We present a new algorithm to improve the scheduling of heterogeneous specifications, i.e. those formed by operations of different types and widths. The scheduling is performed basically in two phases: first, the specification operations are transformed into new ones by extracting their common operative kernel, and secondly, the...

Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays